kw.\*:("Combinatorial optimization")
Results 1 to 25 of 3795
Selection :
Core problems in bi-criteria {0, 1}-knapsack problemsDA SILVA, Carlos Gomes; CLIMACO, Joao; FIGUEIRA, Jose Rui et al.Computers & operations research. 2008, Vol 35, Num 7, pp 2292-2306, issn 0305-0548, 15 p.Article
On k-max-optimizationGORSKI, Jochen; RUZIKA, Stefan.Operations research letters. 2009, Vol 37, Num 1, pp 23-26, issn 0167-6377, 4 p.Article
Dominance rules in combinatorial optimization problemsJOUGLET, Antoine; CARLIER, Jacques.European journal of operational research. 2011, Vol 212, Num 3, pp 433-444, issn 0377-2217, 12 p.Article
Frontiers of AlgorithmicsWU, Xiaodong.Journal of combinatorial optimization. 2012, Vol 23, Num 3, issn 1382-6905, 87 p.Serial Issue
Fourth International Workshop on Algorithms and ComputationFUJITA, Satoshi; RAHMAN, Md. Saidur.Journal of combinatorial optimization. 2012, Vol 24, Num 2, issn 1382-6905, 82 p.Conference Proceedings
Selected Papers from the Biennial International Symposium on Combinatorial Optimization (CO2008), 16-19 March 2008, University of Warwick, UKBO CHEN; CZUMAJ, Artur; DEINEKO, Vladimir et al.Journal of combinatorial optimization. 2010, Vol 19, Num 3, issn 1382-6905, 188 p.Conference Proceedings
Special Issue on Data Mining in BiomedicineSEREF, Onur; XANTHOPOULOS, Petros.Journal of combinatorial optimization. 2009, Vol 17, Num 1, issn 1382-6905, 117 p.Serial Issue
Combinatorial Optimization in Data MiningWANPRACHA ART CHAOVALITWONGSE; SEREF, Onur.Journal of combinatorial optimization. 2008, Vol 15, Num 3, issn 1382-6905, 83 p.Serial Issue
Special issue on bioinformaticsZHU, Binhai.Journal of combinatorial optimization. 2007, Vol 13, Num 3, issn 1382-6905, 85 p.Serial Issue
Selected Papers from the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA 2008). Part IYANG, Boting; CAO AN WANG.Journal of combinatorial optimization. 2009, Vol 18, Num 3, issn 1382-6905, 113 p.Conference Proceedings
Group testing and applicationsDU, Ding-Zhu; HWANG, Frank.Journal of combinatorial optimization. 2008, Vol 15, Num 1, issn 1382-6905, 127 p.Serial Issue
Approximation Algorithms for Combinatorial Optimization ProblemsJANSEN, K; ROLIM, J.Algorithmica. 2001, Vol 30, Num 3, issn 0178-4617, 120 p.Serial Issue
ISAAC'09Journal of combinatorial optimization. 2012, Vol 24, Num 1, issn 1382-6905, 65 p.Conference Proceedings
Selected Papers from the Fourteenth Annual International Conference on Combinatorics and Computation (COCOON 2008), 27-29 June 2008, Dalian, ChinaXIAODONG HU; JIE WANG.Journal of combinatorial optimization. 2011, Vol 21, Num 1, issn 1382-6905, 150 p.Serial Issue
COCOA 2007DRESS, Andreas; YINFENG XU; BINHAI ZHU et al.Journal of combinatorial optimization. 2008, Vol 16, Num 2, issn 1382-6905, 100 p.Conference Proceedings
Selected Papers from the 15th International Computing and Combinatorics ConferenceNGO, Hung.Journal of combinatorial optimization. 2011, Vol 22, Num 3, issn 1382-6905, 202 p.Conference Proceedings
Franco-Canadian Workshop on Combinatorial AlgorithmsBREMMER, David; DEZA, Antoine; SOLTYS, Michael et al.Journal of combinatorial optimization. 2008, Vol 16, Num 4, issn 1382-6905, 102 p.Conference Proceedings
Selected papers from the CTS Conference on Combinatorics and its Applications in Honor of Franck K. Hwang's 65th birthdayCHANG, Gerard J; FU, Hung-Lin; ZHU, Xuding et al.Journal of combinatorial optimization. 2007, Vol 14, Num 2-3, issn 1382-6905, 274 p.Conference Proceedings
L'optimisation combinatoire = Combinatory optimizationFOUILHOUX, Pierre.Pour la science. 2008, Num 369, pp 50-56, issn 0153-4092, 7 p.Article
Recognizing binet matricesMUSITELLI, Antoine.Mathematical programming (Print). 2010, Vol 124, Num 1-2, pp 349-381, issn 0025-5610, 33 p.Conference Paper
Exact algorithms for the two-dimensional strip packing problem with and without rotationsKENMOCHI, Mitsutoshi; IMAMICHI, Takashi; NONOBE, Koji et al.European journal of operational research. 2009, Vol 198, Num 1, pp 73-83, issn 0377-2217, 11 p.Article
New heuristics for packing unequal circles into a circular containerWEN QI HUANG; YU LI; CHU MIN LI et al.Computers & operations research. 2006, Vol 33, Num 8, pp 2125-2142, issn 0305-0548, 18 p.Article
Finding multiple routing paths in wide-area WDM networksWEIFA LIANG; XIAOJUN SHEN.Computer communications. 2005, Vol 28, Num 7, pp 811-818, issn 0140-3664, 8 p.Article
Finding minimal branchings with a given number of arcsCVETKOVIC, Dragos; CANGALOVIC, Mirjana.Yugoslav journal of operations research. 2002, Vol 12, Num 1, pp 1-10, issn 0354-0243, 10 p.Article
Lin-Kernighan heuristic adaptations for the generalized traveling salesman problemKARAPETYAN, D; GUTIN, G.European journal of operational research. 2011, Vol 208, Num 3, pp 221-232, issn 0377-2217, 12 p.Article